T. P. Wiseman (dir.), C

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

T C C P    

This article is an overview of the recent developments of a theory originally introduced by Leifer and Milner: given a formalism with a reduction semantics, a canonical labelled transition system is derived on which bisimilarity as well as other other equivalences are congruences, provided that the contexts of the formalism form the arrows of a category which has certain colimits. We shall also...

متن کامل

T C P  C C++

Using a C++ compiler, any partial recursive function can be computed at compile time. We show this by using the C++ template mechanism to define functions via primitive recursion, composition, and μ-recursion.

متن کامل

P C S  C  D T  P O

In this paper we survey recent results on the precedence constraint single machine scheduling problem to minimize the weighted sum of completion times. We show how we can benefit from known results in dimension theory of partial orders to obtain improved approximate solutions when precedence constraints have low fractional dimension. We believe that dimension theory of partial orders could be o...

متن کامل

T C C N P  F

We define when a linear-time temporal property is a fairness property with respect to a given system. This captures the essence that is shared by most fairness assumptions that are used in the specification and verification of reactive concurrent systems, such as weak fairness, strong fairness, kfairness, and many others. We give three characterisations for the family of all fairness properties...

متن کامل

T D C C S-s  T  P *

This paper advocates the use of self-stabilization as a provable property to achieve the goals of the self-* paradigms for systems, including availability, reliability, serviceability, disaster recovery and autonomic computing. Several recent results starting from hardware concerns, through the operating system, and ending in the applications are integrated: the selfstabilizing microprocessor [...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Anabases

سال: 2007

ISSN: 1774-4296,2256-9421

DOI: 10.4000/anabases.3425